Sublinear domination and core–periphery networks
نویسندگان
چکیده
Abstract In this paper we devise a generative random network model with core–periphery properties whose core nodes act as sublinear dominators , that is, if the has n nodes, size o ( ) and dominates entire network. We show instances generated by exhibit power law degree distributions, incorporates small-world phenomena. also fit our in variety of real-world networks.
منابع مشابه
Measuring domination in directed networks
Dominance relations between individuals can be represented by a directed social network. A relational power measure is a function that assigns to each position in a directed network a value representing the relational power of that position in the network. We axiomatically characterize two such power measures, the b-measure and the score-measure. We also apply these measures to weighted directe...
متن کاملHypo-efficient domination and hypo-unique domination
For a graph $G$ let $gamma (G)$ be its domination number. We define a graph G to be (i) a hypo-efficient domination graph (or a hypo-$mathcal{ED}$ graph) if $G$ has no efficient dominating set (EDS) but every graph formed by removing a single vertex from $G$ has at least one EDS, and (ii) a hypo-unique domination graph (a hypo-$mathcal{UD}$ graph) if $G$ has at least two minimum dominating sets...
متن کاملDomination and Signed Domination Number of Cayley Graphs
In this paper, we investigate domination number as well as signed domination numbers of Cay(G : S) for all cyclic group G of order n, where n in {p^m; pq} and S = { a^i : i in B(1; n)}. We also introduce some families of connected regular graphs gamma such that gamma_S(Gamma) in {2,3,4,5 }.
متن کاملOn Traffic Domination in Communication Networks
Input data for communication network design/optimization problems involving multi-hour or uncertain traffic can consist of a large set of traffic matrices. These matrices are explicitly considered in problem formulations for link dimensioning. However, many of these matrices are usually dominated by others so only a relatively small subset of matrices would be sufficient to obtain proper link c...
متن کاملTotal Domination Number of Cartesian Product Networks
Let denote the Cartesian product of graphs and A total dominating set of with no isolated vertex is a set of vertices of such that every vertex is adjacent to a vertex in The total domination number of is the minimum cardinality of a total dominating set. In this paper, we give a new lower bound of total domination number of using parameters total domination, packing and -domination numbers of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Reports
سال: 2021
ISSN: ['2045-2322']
DOI: https://doi.org/10.1038/s41598-021-94105-8